Semiconvergence of the extended PSS method for singular generalized saddle point problems
نویسندگان
چکیده
Recently, in (M. Masoudi, D.K. Salkuyeh, An extension of positive-definite and skew-Hermitian splitting method for preconditioning generalized saddle point problems, Computers \& Mathematics with Application, https://doi.org/10.1016/j.camwa.2019.10.030, 2019) an the positive definite (EPSS) iteration nonsingular problems has been presented. In this article, we study semi-convergence EPSS singular problems. Then a special case (SEPSS) preconditioner is applied to Some numerical results are presented show effectiveness preconditioner.
منابع مشابه
A modification of the generalized shift-splitting method for singular saddle point problems
A modification of the generalized shift-splitting (GSS) method is presented for solving singular saddle point problems. In this kind of modification, the diagonal shift matrix is replaced by a block diagonal matrix which is symmetric positive definite. Semiconvergence of the proposed method is investigated. The induced preconditioner is applied to the saddle point problem and the preconditioned...
متن کاملSemi-convergence of the Generalized Local Hss Method for Singular Saddle Point Problems
Recently, Zhu [Appl. Math. Comput., 218 (2012), 8816–8824] considered the generalized local HSS (GLHSS) method for solving nonsingular saddle point problems and studied its convergence. In this paper, we prove the semi-convergence of the GLHSS method when it is applied to solve the singular saddle point problems.
متن کاملGeneral constraint preconditioning iteration method for singular saddle-point problems
For the singular saddle-point problems with nonsymmetric positive definite (1, 1) block, we present a general constraint preconditioning (GCP) iteration method based on a singular constraint preconditioner. Using the properties of the Moore-Penrose inverse, the convergence properties of the GCP iteration method are studied. In particular, for each of the two different choices of the (1, 1) bloc...
متن کاملPreconditioners for Generalized Saddle-point Problems Preconditioners for Generalized Saddle-point Problems *
We examine block-diagonal preconditioners and efficient variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. We consider the general, nonsymmetric, nonsingular case. In particular, the (1,2) block need not equal the transposed (2,1) block. Our preconditioners arise from computationally efficient splittings of the (1,1) block. We provide analyses for the...
متن کاملOn generalized SSOR-like iteration method for saddle point problems
In this paper, we study the iterative algorithms for saddle point problems(SPP). We present a new symmetric successive over-relaxation method with three parameters, which is the extension of the SSOR iteration method. Under some suitable conditions, we give the convergence results. Numerical examples further confirm the correctness of the theory and the effectiveness of the method. Key–Words: i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Mathematics
سال: 2021
ISSN: ['1029-0265', '0020-7160', '1026-7425']
DOI: https://doi.org/10.1080/00207160.2021.1938010